Hardness Hypotheses, Derandomization, and Circuit Complexity
نویسندگان
چکیده
منابع مشابه
The Complexity of Hardness Amplification and Derandomization
This thesis studies the interplay between randomness and computation. We investigate this interplay from the perspectives of hardness amplification and derandomization. Hardness amplification is the task of taking a function that is hard to compute on some input or on some fraction of inputs, and producing a new function that is very hard on average, i.e. hard to compute on a fraction of inputs...
متن کاملDerandomization and Distinguishing Complexity
We continue an investigation of resource-bounded Kolmogorov complexity and derandomization techniques begun in [2, 3]. We introduce nondeterministic time-bounded Kolmogorov complexity measures (KNt and KNT) and examine the properties of these measures using constructions of hitting set generators for nondeterministic circuits [22, 26]. We observe that KNt bears many similarities to the nondeter...
متن کاملDerandomization and Circuit Lower Bounds
1 Introduction Primality testing is the following problem: Given a number n in binary, decide whether n is prime. In 1977, Solovay and Strassen [SS77] proposed a new type of algorithm for testing whether a given number is a prime, the celebrated randomized Solovay-Strassen primality test. This test and similar ones proved to be very useful. This fact changed the common notion of " feasible comp...
متن کاملDerandomization via complexity theory
Noam Nisan constructed pseudo random number generators which convert O(S log R) truly random bits to R bits that appear random to any algorithm that runs in SPACE(S). D Sivakumar, demonstrated that a large class of probabilistic algorithms can be derandomized using Nisan’s construction. This class of algorithms is characterized by the fact that each probabilistic algorithm can thought of as a s...
متن کاملOn the (Non) NP-Hardness of Computing Circuit Complexity
The Minimum Circuit Size Problem (MCSP) is: given the truth table of a Boolean function f and a size parameter k, is the circuit complexity of f at most k? This is the definitive problem of circuit synthesis, and it has been studied since the 1950s. Unlike many problems of its kind, MCSP is not known to be NP-hard, yet an efficient algorithm for this problem also seems very unlikely: for exampl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: computational complexity
سال: 2008
ISSN: 1016-3328,1420-8954
DOI: 10.1007/s00037-008-0241-5